0.04/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.09	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.08/0.29	% Computer : n003.cluster.edu
0.08/0.29	% Model    : x86_64 x86_64
0.08/0.29	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.08/0.29	% Memory   : 8042.1875MB
0.08/0.29	% OS       : Linux 3.10.0-693.el7.x86_64
0.08/0.29	% CPULimit   : 1920
0.08/0.29	% WCLimit    : 240
0.08/0.29	% DateTime   : Wed Jul 30 08:29:19 EDT 2025
0.08/0.29	% CPUTime    : 
0.15/0.37	Running higher-order theorem proving
0.15/0.39	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p
0.15/0.47	# Version: 3.0.0-ho
0.15/0.47	# Preprocessing class: HSLMSMSSLLLCHSA.
0.15/0.47	# Scheduled 6 strats onto 8 cores with 240 seconds (1920 total)
0.15/0.47	# Starting lpo1_fix with 720s (3) cores
0.15/0.47	# Starting full_lambda_9 with 240s (1) cores
0.15/0.47	# Starting almost_fo_4 with 240s (1) cores
0.15/0.47	# Starting new_ho_9 with 240s (1) cores
0.15/0.47	# Starting pre_casc_4 with 240s (1) cores
0.15/0.47	# Starting ho_unfolding_6 with 240s (1) cores
0.15/0.47	# full_lambda_9 with pid 806 completed with status 0
0.15/0.47	# Result found by full_lambda_9
0.15/0.47	# Preprocessing class: HSLMSMSSLLLCHSA.
0.15/0.47	# Scheduled 6 strats onto 8 cores with 240 seconds (1920 total)
0.15/0.47	# Starting lpo1_fix with 720s (3) cores
0.15/0.47	# Starting full_lambda_9 with 240s (1) cores
0.15/0.47	# SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
0.15/0.47	# Search class: HGHSM-FSLM32-DHSMMSBN
0.15/0.47	# partial match(1): HGHSM-FSLM32-MHSMMSBN
0.15/0.47	# Scheduled 12 strats onto 1 cores with 240 seconds (240 total)
0.15/0.47	# Starting full_lambda_5 with 20s (1) cores
0.15/0.47	# full_lambda_5 with pid 822 completed with status 0
0.15/0.47	# Result found by full_lambda_5
0.15/0.47	# Preprocessing class: HSLMSMSSLLLCHSA.
0.15/0.47	# Scheduled 6 strats onto 8 cores with 240 seconds (1920 total)
0.15/0.47	# Starting lpo1_fix with 720s (3) cores
0.15/0.47	# Starting full_lambda_9 with 240s (1) cores
0.15/0.47	# SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
0.15/0.47	# Search class: HGHSM-FSLM32-DHSMMSBN
0.15/0.47	# partial match(1): HGHSM-FSLM32-MHSMMSBN
0.15/0.47	# Scheduled 12 strats onto 1 cores with 240 seconds (240 total)
0.15/0.47	# Starting full_lambda_5 with 20s (1) cores
0.15/0.47	# Preprocessing time       : 0.004 s
0.15/0.47	# Presaturation interreduction done
0.15/0.47	
0.15/0.47	# Proof found!
0.15/0.47	# SZS status Theorem
0.15/0.47	# SZS output start CNFRefutation
0.15/0.47	thf(decl_23, type, is_of: $i > ($i > $o) > $o).
0.15/0.47	thf(decl_24, type, all_of: ($i > $o) > ($i > $o) > $o).
0.15/0.47	thf(decl_26, type, in: $i > $i > $o).
0.15/0.47	thf(decl_48, type, ordsucc: $i > $i).
0.15/0.47	thf(decl_62, type, imp: $o > $o > $o).
0.15/0.47	thf(decl_63, type, d_not: $o > $o).
0.15/0.47	thf(decl_68, type, l_or: $o > $o > $o).
0.15/0.47	thf(decl_73, type, l_some: $i > ($i > $o) > $o).
0.15/0.47	thf(decl_78, type, e_is: $i > $i > $i > $o).
0.15/0.47	thf(decl_124, type, nat: $i).
0.15/0.47	thf(decl_125, type, n_is: $i > $i > $o).
0.15/0.47	thf(decl_128, type, n_some: ($i > $o) > $o).
0.15/0.47	thf(decl_148, type, diffprop: $i > $i > $i > $o).
0.15/0.47	thf(decl_149, type, d_29_ii: $i > $i > $o).
0.15/0.47	thf(decl_150, type, iii: $i > $i > $o).
0.15/0.47	thf(decl_152, type, moreis: $i > $i > $o).
0.15/0.47	thf(decl_153, type, lessis: $i > $i > $o).
0.15/0.47	thf(decl_156, type, esk1_0: $i).
0.15/0.47	thf(decl_157, type, esk2_0: $i).
0.15/0.47	thf(def_d_not, axiom, ((d_not)=(^[X36:$o]:((imp @ ((X36)) @ (~($true)))))), file('/export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p', def_d_not)).
0.15/0.47	thf(def_imp, axiom, ((imp)=(^[X34:$o, X35:$o]:(((X34)=>(X35))))), file('/export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p', def_imp)).
0.15/0.47	thf(def_iii, axiom, ((iii)=(^[X1:$i, X185:$i]:((n_some @ (diffprop @ X185 @ X1))))), file('/export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p', def_iii)).
0.15/0.47	thf(def_l_or, axiom, ((l_or)=(^[X42:$o]:(imp @ ((d_not @ ((X42))))))), file('/export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p', def_l_or)).
0.15/0.47	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p', def_e_is)).
0.15/0.47	thf(def_lessis, axiom, ((lessis)=(^[X1:$i, X188:$i]:((l_or @ ((iii @ X1 @ X188)) @ ((n_is @ X1 @ X188)))))), file('/export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p', def_lessis)).
0.15/0.47	thf(def_n_some, axiom, ((n_some)=(l_some @ nat)), file('/export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p', def_n_some)).
0.15/0.47	thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p', def_n_is)).
0.15/0.47	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p', def_all_of)).
0.15/0.47	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p', def_is_of)).
0.15/0.47	thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p', def_d_29_ii)).
0.15/0.47	thf(def_moreis, axiom, ((moreis)=(^[X1:$i, X187:$i]:((l_or @ ((d_29_ii @ X1 @ X187)) @ ((n_is @ X1 @ X187)))))), file('/export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p', def_moreis)).
0.15/0.47	thf(satz25c, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X329:$i]:((in @ X329 @ nat))) @ (^[X330:$i]:(((iii @ X330 @ X1)=>(lessis @ (ordsucc @ X330) @ X1)))))))), file('/export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p', satz25c)).
0.15/0.47	thf(satz25a, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X325:$i]:((in @ X325 @ nat))) @ (^[X326:$i]:(((d_29_ii @ X326 @ X1)=>(moreis @ X326 @ (ordsucc @ X1))))))))), file('/export/starexec/sandbox2/tmp/tmp.5F9CkwfRJe/E---3.1_676.p', satz25a)).
0.15/0.47	thf(c_0_14, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_not])).
0.15/0.47	thf(c_0_15, plain, ((imp)=(^[Z0/* 19 */:$o, Z1:$o]:(((Z0)=>(Z1))))), inference(fof_simplification,[status(thm)],[def_imp])).
0.15/0.47	thf(c_0_16, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z1 @ Z0))))), inference(fof_simplification,[status(thm)],[def_iii])).
0.15/0.47	thf(c_0_17, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(fof_simplification,[status(thm)],[def_l_or])).
0.15/0.47	thf(c_0_18, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_14, c_0_15])).
0.15/0.47	thf(c_0_19, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
0.15/0.47	thf(c_0_20, plain, ((lessis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (diffprop @ Z1 @ Z0))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(fof_simplification,[status(thm)],[def_lessis])).
0.15/0.47	thf(c_0_21, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z1 @ Z0))))), inference(apply_def,[status(thm)],[c_0_16, def_n_some])).
0.15/0.47	thf(c_0_22, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_17, c_0_15]), c_0_18])).
0.15/0.47	thf(c_0_23, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_19])).
0.15/0.47	thf(c_0_24, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
0.15/0.47	thf(c_0_25, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
0.15/0.47	thf(c_0_26, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])).
0.15/0.47	thf(c_0_27, plain, ((lessis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (diffprop @ Z1 @ Z0))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20, c_0_21]), c_0_22]), c_0_23])).
0.15/0.47	thf(c_0_28, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_24, c_0_25])).
0.15/0.47	thf(c_0_29, plain, ((moreis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (diffprop @ Z0 @ Z1))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(fof_simplification,[status(thm)],[def_moreis])).
0.15/0.47	thf(c_0_30, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z0 @ Z1))))), inference(apply_def,[status(thm)],[c_0_26, def_n_some])).
0.15/0.47	thf(c_0_31, negated_conjecture, ~(![X422:$i]:(((in @ X422 @ nat)=>![X421:$i]:(((in @ X421 @ nat)=>((l_some @ nat @ (diffprop @ X422 @ X421))=>(((l_some @ nat @ (diffprop @ X422 @ (ordsucc @ X421)))=>~($true))=>((ordsucc @ X421)=(X422))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz25c])]), c_0_27]), c_0_21]), c_0_28])).
0.15/0.47	thf(c_0_32, plain, ((moreis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (diffprop @ Z0 @ Z1))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_29, c_0_30]), c_0_22]), c_0_23])).
0.15/0.47	thf(c_0_33, negated_conjecture, ((in @ esk1_0 @ nat)&((in @ esk2_0 @ nat)&((l_some @ nat @ (diffprop @ esk1_0 @ esk2_0))&((~(l_some @ nat @ (diffprop @ esk1_0 @ (ordsucc @ esk2_0)))|~($true))&((ordsucc @ esk2_0)!=(esk1_0)))))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])])).
0.15/0.47	thf(c_0_34, plain, ![X568:$i]:(((in @ X568 @ nat)=>![X567:$i]:(((in @ X567 @ nat)=>((l_some @ nat @ (diffprop @ X567 @ X568))=>(((l_some @ nat @ (diffprop @ X567 @ (ordsucc @ X568)))=>~($true))=>((X567)=(ordsucc @ X568)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz25a]), c_0_30]), c_0_28]), c_0_32])).
0.15/0.47	thf(c_0_35, negated_conjecture, (~((l_some @ nat @ (diffprop @ esk1_0 @ (ordsucc @ esk2_0))))|~(($true))), inference(split_conjunct,[status(thm)],[c_0_33])).
0.15/0.47	thf(c_0_36, plain, ![X807:$i, X808:$i]:((((l_some @ nat @ (diffprop @ X808 @ (ordsucc @ X807)))|((X808)=(ordsucc @ X807))|~(l_some @ nat @ (diffprop @ X808 @ X807))|~(in @ X808 @ nat)|~(in @ X807 @ nat))&(($true)|((X808)=(ordsucc @ X807))|~(l_some @ nat @ (diffprop @ X808 @ X807))|~(in @ X808 @ nat)|~(in @ X807 @ nat)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])])])).
0.15/0.47	thf(c_0_37, negated_conjecture, ~((l_some @ nat @ (diffprop @ esk1_0 @ (ordsucc @ esk2_0)))), inference(cn,[status(thm)],[c_0_35])).
0.15/0.47	thf(c_0_38, plain, ![X1:$i, X4:$i]:(((l_some @ nat @ (diffprop @ X1 @ (ordsucc @ X4)))|((X1)=(ordsucc @ X4))|~((l_some @ nat @ (diffprop @ X1 @ X4)))|~((in @ X1 @ nat))|~((in @ X4 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_36])).
0.15/0.47	thf(c_0_39, negated_conjecture, (l_some @ nat @ (diffprop @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_33])).
0.15/0.47	thf(c_0_40, negated_conjecture, (in @ esk2_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_33])).
0.15/0.47	thf(c_0_41, negated_conjecture, (in @ esk1_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_33])).
0.15/0.47	thf(c_0_42, negated_conjecture, ((ordsucc @ esk2_0)!=(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_33])).
0.15/0.47	thf(c_0_43, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_39]), c_0_40]), c_0_41])]), c_0_42]), ['proof']).
0.15/0.47	# SZS output end CNFRefutation
0.15/0.47	# Parsed axioms                        : 404
0.15/0.47	# Removed by relevancy pruning/SinE    : 231
0.15/0.47	# Initial clauses                      : 427
0.15/0.47	# Removed in clause preprocessing      : 189
0.15/0.47	# Initial clauses in saturation        : 238
0.15/0.47	# Processed clauses                    : 485
0.15/0.47	# ...of these trivial                  : 5
0.15/0.47	# ...subsumed                          : 88
0.15/0.47	# ...remaining for further processing  : 392
0.15/0.47	# Other redundant clauses eliminated   : 32
0.15/0.47	# Clauses deleted for lack of memory   : 0
0.15/0.47	# Backward-subsumed                    : 0
0.15/0.47	# Backward-rewritten                   : 0
0.15/0.47	# Generated clauses                    : 909
0.15/0.47	# ...of the previous two non-redundant : 855
0.15/0.47	# ...aggressively subsumed             : 0
0.15/0.47	# Contextual simplify-reflections      : 2
0.15/0.47	# Paramodulations                      : 712
0.15/0.47	# Factorizations                       : 2
0.15/0.47	# NegExts                              : 2
0.15/0.47	# Equation resolutions                 : 36
0.15/0.47	# Disequality decompositions           : 0
0.15/0.47	# Total rewrite steps                  : 96
0.15/0.47	# ...of those cached                   : 61
0.15/0.47	# Propositional unsat checks           : 0
0.15/0.47	#    Propositional check models        : 0
0.15/0.47	#    Propositional check unsatisfiable : 0
0.15/0.47	#    Propositional clauses             : 0
0.15/0.47	#    Propositional clauses after purity: 0
0.15/0.47	#    Propositional unsat core size     : 0
0.15/0.47	#    Propositional preprocessing time  : 0.000
0.15/0.47	#    Propositional encoding time       : 0.000
0.15/0.47	#    Propositional solver time         : 0.000
0.15/0.47	#    Success case prop preproc time    : 0.000
0.15/0.47	#    Success case prop encoding time   : 0.000
0.15/0.47	#    Success case prop solver time     : 0.000
0.15/0.47	# Current number of processed clauses  : 205
0.15/0.47	#    Positive orientable unit clauses  : 70
0.15/0.47	#    Positive unorientable unit clauses: 7
0.15/0.47	#    Negative unit clauses             : 9
0.15/0.47	#    Non-unit-clauses                  : 119
0.15/0.47	# Current number of unprocessed clauses: 765
0.15/0.47	# ...number of literals in the above   : 2541
0.15/0.47	# Current number of archived formulas  : 0
0.15/0.47	# Current number of archived clauses   : 165
0.15/0.47	# Clause-clause subsumption calls (NU) : 10348
0.15/0.47	# Rec. Clause-clause subsumption calls : 2418
0.15/0.47	# Non-unit clause-clause subsumptions  : 76
0.15/0.47	# Unit Clause-clause subsumption calls : 300
0.15/0.47	# Rewrite failures with RHS unbound    : 32
0.15/0.47	# BW rewrite match attempts            : 128
0.15/0.47	# BW rewrite match successes           : 4
0.15/0.47	# Condensation attempts                : 0
0.15/0.47	# Condensation successes               : 0
0.15/0.47	# Termbank termtop insertions          : 79713
0.15/0.47	# Search garbage collected termcells   : 20864
0.15/0.47	
0.15/0.47	# -------------------------------------------------
0.15/0.47	# User time                : 0.059 s
0.15/0.47	# System time              : 0.005 s
0.15/0.47	# Total time               : 0.064 s
0.15/0.47	# Maximum resident set size: 5512 pages
0.15/0.47	
0.15/0.47	# -------------------------------------------------
0.15/0.47	# User time                : 0.064 s
0.15/0.47	# System time              : 0.008 s
0.15/0.47	# Total time               : 0.072 s
0.15/0.47	# Maximum resident set size: 2408 pages
0.15/0.47	% E exiting
0.15/0.47	% E exiting
0.15/0.47	EOF